Anup Rao

Professor · University of Washington

I work in complexity theory - mostly communication complexity, circuit lower bounds and pseudorandomness - with occasional detours into economics and finance.

anuprao@cs.washington.edu ↗
Anup with a child at the beachAnup tossing a child in the air at the beachAnup with a child outdoors

Selected publications

Complete list ↗
  1. Monotone circuit lower bounds from spread matchingsManuscript · 2026
  2. The story of sunflowersJournal of the London Mathematical Society · 2025
  3. Six solutions to the money supply problemResearch Works · 2025
  4. An XOR lemma for deterministic communication complexitywith Siddharth Iyer · FOCS 2024
  5. XOR lemmas for communication via marginal informationwith Siddharth Iyer · STOC 2024

Teaching

Foundations of Computer Science II (CSE 312), with Paul Beame · Autumn 2026.

All courses ↗

Book

Cover of Communication Complexity and Applications

Communication Complexity and Applications
with Amir Yehudayoff